New Algorithms for Capacity Allocation and Scheduling of Multiplexed Variable Bit Rate Video Sources
نویسندگان
چکیده
This study presents simple and accurate heuristics for determining the equivalent bandwidth for multiplexed variable bit rate (VBR) video sources. The results are based on empirical studies of measurement data of various classes of VBR video sources. They are also validated through extensive simulation. The principal result is that the equivalent bandwidth per source for n independent and identically distributed VBR video sources may be approximated by a hyperbolic function of the form: a coth -1n + b where a and b are independent of n. Further, assuming ∈ is the acceptable loss tolerance, statistical regression shows that b is a linear function of mean and log ( ∈ ), while a is a polynomial in log( ∈ ). The capacity assignment problem is further augmented with a scheduling algorithm that is an extension of the Virtual Clock Algorithm. The new algorithm belongs to a class of algorithms which we refer to as Generalized Virtual Clock (GVC) algorithms. The particular GVC algorithm investigated in this paper estimates the instantaneous rate of transmission of each source, and uses the estimate instead of the static average rates, for prioritizing packets. In so doing, it attempts to synchronize the switch scheduling rates and the packet arrival rates of each source, and improves upon the spatial loss distribution characteristics of Virtual Clock. The combined allocation and scheduling algorithms are proposed as means for guaranteeing Quality of Service in high speed networks. Comments University of Pennsylvania Department of Computer and Information Science Technical Report No. MSCIS-92-08. This technical report is available at ScholarlyCommons: http://repository.upenn.edu/cis_reports/396 New Algorithms for Capacaity Allocation and Scheduling Of Multiplexed Variable Bit Rate Video Sources MS-CIS-92-08 DISTRIBUTED SYSTEMS LAB 10 Amarnath Mukherjee Jaffar Rehman University of Pennsylvania School of Engineering and Applied Science Computer and Information Science Department Philadelphia, PA 19104-6389
منابع مشابه
A Full-Fuzzy Rate Controller for Variable Bit Rate Video
In this paper, we propose a new full-fuzzy video ratecontrol algorithm (RCA) for variable bit rate (VBR) videoapplications. The proposed RCA provides high qualitycompressed video with a low degree computational complexity.By controlling the quantization parameter (QP) on a picturebasis, it produces VBR video bit streams. The proposed RCAhas been implemented on the JM H.264/AVC video codec andth...
متن کاملالگوریتم کنترل نرخ بیت متغیر ویدئو در سطح گروه تصاویر برای استاندارد فشردهسازی H.265
A rate control algorithm at the group of picture (GOP) level is proposed in this paper for variable bit rate applications of the H.265/HEVC video coding standard with buffer constraint. Due to structural changes in the HEVC compared to the previous standards, new rate control algorithms are needed to be designed. In the proposed algorithm, quantization parameter (QP) of each GOP is obtained by ...
متن کاملارزیابی سیاستهای زمانبندی در نسل چهارم شبکههای سلولی (LTE)
New generation of wireless networks, LTE and WiMAX, supports many services which consume a lot of resources (such as VOIP, Video Conference, Digital Video, Multimedia streams and online Multi-player Games). Supporting multi-media services in wireless communication systems provide new resource allocation challenges. Because of high loads in downlink, efficient resource allocation is vital in dow...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014